Highly concurrent logically synchronous multicast
نویسندگان
چکیده
منابع مشابه
Highly Concurrent Logically Synchronous Multicast Kenneth
We deilne the logically synchronous muliirast problem, which imposes a natura] and useful structure on message delivery order in an asynchronous system. In this problem, a computation proceeds by a sequence of rnulticasts, in which a process sends a message to some arbitrary subset of the processes, including itselL A logically synchronous rnu1tcast protocol must make t appear to ever) process ...
متن کاملPALS: Physically Asynchronous Logically Synchronous Systems
In networked cyber physical systems real time global computations, e.g., the supervisory control of a flight control system, require consistent views, consistent actions and synchronized state transitions across network nodes in real time. This paper presents a real time logical synchrony protocol, Physically Asynchronous Logically Synchronous (PALS), to support real time global computation. Un...
متن کاملConcurrent Multicast in Weighted Networks
Concurrent multicast is the problem of information dissemination from a set of source nodes to a set of destination nodes in a network with cost function: Each source node s needs to multicast a block of data B(s) to the set of destinations. We are interested in protocols for this problem which have minimum communication cost. We consider both the usual case in which any transmitted message can...
متن کاملHighly Concurrent Shared Storage
Switched system-area networks enable thousands of storage devices to be shared and directly accessed by end hosts, promising databases and filesystems highly scalable, reliable storage. In such systems, hosts perform access tasks (read and write) and management tasks (storage migration and reconstruction of data on failed devices.) Each task translates into multiple phases of low-level device I...
متن کاملHIGHLY NON-CONCURRENT LONGEST.dvi
There exist planar graphs in which any two vertices are missed by some longest cycle. Although this requirement is very strong, we prove here that such graphs can also be found as subgraphs of the square and hexagonal lattices. Considering (finite) such lattices on the torus and on the Möbius strip enables us to reduce the order of our examples. Introduction Do we have small (if possible minima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 1991
ISSN: 0178-2770,1432-0452
DOI: 10.1007/bf01784720